package com.cy.letcode.link.合并k个升序链表;

/**
 *
 */
class 优先级队列Solution {


    /**
     * 优先级队列
     */
    class Status implements Comparable<Status> {
        int val;
        ListNode ptr;

        Status(int val, ListNode ptr) {
            this.val = val;
            this.ptr = ptr;
        }

        @Override
        public int compareTo(Status o) {
            return this.val - o.val;
        }
    }

//    public ListNode mergeKLists(ListNode[] lists) {
//        return;
//    }


}